Equations for Lower Bounds on Border Rank

نویسندگان

  • Jonathan D. Hauenstein
  • Christian Ikenmeyer
  • J. M. Landsberg
چکیده

We present new methods for determining polynomials in the ideal of the variety of bilinear maps of border rank at most r. We apply these methods to several cases including the case r = 6 in the space of bilinear maps C × C → C. This space of bilinear maps includes the matrix multiplication operator M2 for two by two matrices. We show these newly obtained polynomials do not vanish on the matrix multiplication operator M2, which gives a new proof that the border rank of the multiplication of 2× 2 matrices is seven. Other examples are considered along with an explanation of how to implement the methods. Acknowledgements. We thank Peter Bürgisser for important discussions and suggestions, and the anonymous reviewer for many helpful comments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New lower bounds for the border rank of matrix multiplication

The border rank of the matrix multiplication operator for n× n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n2−n. Our bounds are better than the previous lower bound (due to Lickteig in 1985) of 2 n 2 + 2 −1 for all n≥ 3. The bounds are obtained by finding new equations that bilinear ma...

متن کامل

Border Ranks of Monomials

Young flattenings, introduced by Landsberg and Ottaviani, give determinantal equations for secant varieties and provide lower bounds for border ranks of tensors. We find special monomial-optimal Young flattenings that provide the best possible lower bound for all monomials up to degree 6. For degree 7 and higher these flattenings no longer suffice for all monomials. To overcome this problem we ...

متن کامل

On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry

We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the determinant polynomial) come in families that include representatives with normal forms. These normal forms will be useful both to develop new efficient algorithms a...

متن کامل

Explicit tensors of border rank at least 2n-1

For odd m, I write down tensors in C m ⊗C m ⊗C m of border rank at least 2m − 1, showing the non-triviality of the Young-flattening equations of [6] that vanish on the matrix multiplication tensor. I also study the border rank of the tensors of [1] and [3]. I show the tensors T 2 k ∈ C k ⊗C 2 k ⊗C 2 k , of [1], despite having rank equal to 2 k+1 − 1, have border rank equal to 2 k. I show the eq...

متن کامل

Koszul-Young Flattenings and Symmetric Border Rank of the Determinant

We present new lower bounds for the symmetric border rank of the n × n determinant for all n. Further lower bounds are given for the 3 × 3 permanent.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Experimental Mathematics

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2013